SAT-Inspired Eliminations for Superposition

Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to first-order logic with equality. In this article, we port inprocessing work superposition, a leading proof calculus, and strengthen known techniques. Specifically, look into elimination of hidden literals, variables (predicates), blocked clauses. Our evaluation using Zipperposition prover confirms that new usefully supplement existing superposition machinery.